Fault tolerant anonymous channel

نویسندگان

  • Wakaha Ogata
  • Kaoru Kurosawa
  • Kazue Sako
  • Kazunori Takatani
چکیده

Previous anonymous channels, called MIX nets, do not work if one center stops. This paper shows new anonymous channels which allow less than a half of faulty centers. A fault tolerant multivalued election scheme is obtained automatically. A very eecient ZKIP for the centers is also presented.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Recent Results on Fault-Tolerance Consensus in Message-Passing Networks

This paper surveys recent results on fault-tolerant consensus in message-passing networks. We focus on two categories of works: (i) new problem formulations (including input domain, fault model, network model...etc.), and (ii) practical applications. For the second part, we focus on Crash Fault-Tolerant (CFT) systems that use Paxos or Raft, and Byzantine Fault-Tolerant (BFT) systems. We also br...

متن کامل

Fault-Tolerant Simulation of Message-Passing Algorithms by Mobile Agents

The recently established computational equivalence between the traditional message-passing model and the mobile-agents model is based on the existence of a mobile-agents algorithm that simulates the execution of message-passing algorithms. Like most existing protocols for mobile agents, this simulation protocol works correctly only if the agents are fault-free. We consider the problem of perfor...

متن کامل

CAFT: Cost-aware and Fault-tolerant routing algorithm in 2D mesh Network-on-Chip

By increasing, the complexity of chips and the need to integrating more components into a chip has made network –on- chip known as an important infrastructure for network communications on the system, and is a good alternative to traditional ways and using the bus. By increasing the density of chips, the possibility of failure in the chip network increases and providing correction and fault tol...

متن کامل

Adaptive fault-tolerant wormhole routing algorithms with low virtual channel requirements

We present simple methods to enhance a recently proposed class of fully adaptive algorithms for fault tolerant wormhole routing These algorithms are based on Duato s theory and are being used in several research projects We show that with three virtual channels per physical channel mulitple rectangular shaped fault blocks can be tolerated in two dimensional meshes There is no restriction on the...

متن کامل

Channel Reiication: a Reeective Approach to Fault-tolerant Software Development

Reeective systems can be used to ease the implementation of fault tolerance mechanisms in distributed applications as show in Anc95, Fab94]. In this paper we introduce a new model for reeective computations, and we show how it can be used for building up fault tolerant applications.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997